Overlapping Cluster Planarity
نویسندگان
چکیده
منابع مشابه
Planarity of Overlapping Clusterings Including Unions of Two Partitions
We show that clustered planarity with overlapping clusters as introduced by Didimo et al. [14] can be solved in polynomial time if each cluster induces a connected subgraph. It can be solved in linear time if the set of clusters is the union of two partitions of the vertex set such that, for each cluster, both the cluster and its complement, induce connected subgraphs. Clustered planarity with ...
متن کاملOverlapping Community Detection by Online Cluster Aggregation
We present a new online algorithm for detecting overlapping communities. The main ingredients are a modification of an online k-means algorithm and a new approach to modelling overlap in communities. An evaluation on large benchmark graphs shows that the quality of discovered communities compares favourably to several methods in the recent literature, while the running time is significantly imp...
متن کاملOrdered Level Planarity and Geodesic Planarity
We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a y-monotone curve. This can be interpreted as a variant of Level Planarity in which the vertices on each level appear in a prescribed total order. We show NP-completeness even for the spe...
متن کاملOrdered Level Planarity, Geodesic Planarity and Bi-Monotonicity
We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a y-monotone curve. This can be interpreted as a variant of Level Planarity in which the vertices on each level appear in a prescribed total order. We establish a complexity dichotomy with...
متن کاملToward a Theory of Planarity: Hanani-Tutte and Planarity Variants
We study Hanani-Tutte style theorems for various notions of planarity, including partially embedded planarity and simultaneous planarity. This approach brings together the combinatorial, computational and algebraic aspects of planarity notions and may serve as a uniform foundation for planarity, as suggested earlier in the writings of Tutte and Wu. Submitted: November 2012 Reviewed: March 2013 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2008
ISSN: 1526-1719
DOI: 10.7155/jgaa.00167